On the spectral distribution of large weighted random regular graphs
نویسندگان
چکیده
منابع مشابه
Distribution of subgraphs of random regular graphs
The asymptotic distribution of small subgraphs of a random graph has been basically worked out (see Ruciński [5] for example). But for random regular graphs, the main techniques for proving, for instance, asymptotic normality, do not seem to be usable. One very recent result in this direction is to be found in [3], where switchings were applied to cycle counts. The aim of the present note is to...
متن کاملOn the asymmetry of random regular graphs and random graphs
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d-regular graph on n vertices almost surely has no non-trivial automorphisms. This answers an open question of N. Wormald [13].
متن کاملPeriodic Walks on Large Regular Graphs and Random Matrix Theory
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of t-periodic walks and its mean, when the cardinality of the vertex set V and the period t approach ∞ with t/V → τ for any τ . This formula is based on the conjecture that the spectral statistics of the adjacency eigenvalues...
متن کاملSparse Regular Random Graphs: Spectral Density and Eigenvectors
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of vertices, the empirical spectral distribution converges to the semicircle law. Moreover, we prove concentration estimates on the number of eigenvalues over progressi...
متن کاملLarge k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense). We consider the problem of approximating the solution to the maximum k-separated matching problem in random r-regular graphs for each fixed integer k and each fixed r ≥ 3. We prove both constructive lower bounds and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Matrices: Theory and Applications
سال: 2014
ISSN: 2010-3263,2010-3271
DOI: 10.1142/s2010326314500154